Single Tree Grammars
نویسندگان
چکیده
A context-free grammar is a single-tree grammar (STG) if every nonterminal symbol has at most one production rule whose right hand side contains nonterminal symbols. Various properties of this class of grammars are studied. Although most properties of STG’s are undecidable, every linear STG generates a bounded language and a deterministic context-free language, so most properties of linear STG’s are decidable. Finally, we show that STG grammars have natural applications for logic database query languages.
منابع مشابه
Alternating Regular Tree Grammars in the Framework of Lattice-Valued Logic
In this paper, two different ways of introducing alternation for lattice-valued (referred to as {L}valued) regular tree grammars and {L}valued top-down tree automata are compared. One is the way which defines the alternating regular tree grammar, i.e., alternation is governed by the non-terminals of the grammar and the other is the way which combines state with alternation. The first way is ta...
متن کاملPreRkTAG: Prediction of RNA Knotted Structures Using Tree Adjoining Grammars
Background: RNA molecules play many important regulatory, catalytic and structural <span style="font-variant: normal; font-style: norma...
متن کاملGenerating Parallel Multilingual LFG-TAG Grammars from a MetaGrammar
We introduce a MetaGrammar, which allows us to automatically generate, from a single and compact MetaGrammar hierarchy, parallel Lexical Functional Grammars (LFG) and Tree-Adjoining Grammars (TAG) for French and for English: the grammar writer specifies in compact manner syntactic properties that are potentially framework-, and to some extent language-independent (such as subcategorization, val...
متن کاملGenerating LTAG grammars from a lexicon/ontology interface
This paper shows how domain-specific grammars can be automatically generated from a declarative model of the lexicon-ontology interface and how those grammars can be used for question answering. We show a specific implementation of the approach using Lexicalized Tree Adjoining Grammars. The main characteristic of the generated elementary trees is that they constitute domains of locality that sp...
متن کاملExploring the Underspeciied World of Lexicalized Tree Adjoining Grammars
This paper presents a precise characterization of the underspeciication found in Lexicalized Tree Adjoining Grammars, and shows that, in a sense, the same degree of underspeciication is found in Lexicalized D-Tree Substitution Grammars. Rather than describing directly the nature of the elementary objects of the grammar, we achieve our objective by formalizing the way in which underspeciication ...
متن کاملOne-Pass, Optimal Tree Parsing - With Or Without Trees
This paper describes the theory behind and implementation of wburg, a code-generator generator that accepts tree grammars as input and produces a code generator that emits an optimal parse of an IR tree in just a single bottom-up pass. Furthermore, wburg eliminates the need for an explicit IR tree altogether. The grammars that wburg-generated parsers can parse are a proper subset of those that ...
متن کامل